منابع مشابه
On Termination of Constraint Logic Programs
This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing the operational behaviour of constraint logic programs. Then termination is proven using a technique inspired by ...
متن کاملOn Termination of Constraint Logic Programs
Abst rac t . This paper introduces a necessary and sufficient condition for termination of constraint logic programs. The method is based on assigning a dataflow graph to a program, whose nodes are the program points and whose arcs are abstractions of the rules of a transition system, describing the operational behaviour of constraint logic programs. Then termination is proven using a technique...
متن کاملNon-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given class of queries, i.e. finiteness of all the possible derivations produced by a Prolog engine from any query in that class. In contrast, the study of the dual problem: nontermination w.r.t. the left selection rule i....
متن کاملTermination Analysis for Logic Programs
I survey termination analysis of logic programs with particular attention to methods for automatically proving termination. I introduce the central concepts of automatic termination analysis and give an overview of the research on other types of termination analysis. I describe the main approaches covered in the literature and compare the accuracy and eeciency of each of them.
متن کاملTermination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were developed for term rewriting) to the logic programming domain. The main idea of the approach is that termination conditions for a program are established based on the decomposition of its dependency graph into its strong...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1999
ISSN: 0164-0925,1558-4593
DOI: 10.1145/330643.330645